Relation Between Number of Processes and Number of Resources to Prevent Deadlock
A set of blocked processes where each process is holding some resource and waiting to acquire some other resource held by another process in the set. This situation is called deadlock in the operating system....
read more
Difference between a process stack and a CPU stack
Temporary data like as method/function arguments, return address, and local variables are stored on the process Stack, whereas on the other hand, the CPU stack consists of a collection of data words. It employs the Last In First Out (LIFO) access technique, which is the most common in most CPUs. In this article we are going to find out the detailed difference between both of these....
read more
Classful Vs Classless Addressing
Classful Addressing: Introduced in 1981, with classful routing, IP v4 addresses were divided into 5 classes(A to E)....
read more
Difference between Top down parsing and Bottom up parsing
There are 2 types of Parsing techniques present parsing, the first one is Top-down parsing and the second one is Bottom-up parsing. Top-down parsing is a parsing technique that first looks at the highest level of the parse tree and works down the parse tree by using the rules of grammar while Bottom-up Parsing is a parsing technique that first looks at the lowest level of the parse tree and works up the parse tree by using the rules of grammar....
read more
Variable (or Dynamic) Partitioning in Operating System
In operating systems, Memory Management is the function responsible for allocating and managing a computer’s main memory. The memory Management function keeps track of the status of each memory location, either allocated or free to ensure effective and efficient use of Primary Memory....
read more
Error detection and Recovery in Compiler
In this phase of compilation, all possible errors made by the user are detected and reported to the user in form of error messages. This process of locating errors and reporting them to users is called the Error Handling process....
read more
Parallel Adder and Parallel Subtractor
Prerequisite – Full adder, Full Subtractor...
read more
Introduction of Logic Gates
In Boolean Algebra, there are three basic operations, [Tex]+,\:.\:,\:^\prime       [/Tex]which are analogous to disjunction, conjunction, and negation in propositional logic. Each of these operations has a corresponding logic gate. Apart from these, there are a few other logic gates as well. It was invented by George Boole....
read more
Data Structures and Algorithms | Set 32
Following questions have been asked in GATE CS 2014 exam....
read more
Data Structures and Algorithms | Set 15
Following questions have been asked in GATE CS 2008 exam....
read more
Difference between SHA1 and SHA2
1. SHA1 (Secure Hash Algorithm 1) : SHA1 is a cryptographic hash function which is designed by United States National Security Agency. It takes an input and produces a 160 bits hash value. Further the output produced by this function is converted into a 40 digits long hexadecimal number. It is a U.S. Federal Information Processing Standard. It was first published in 1995. It is successor to SH0 published in 1993. Example:...
read more
Local Broadcast and Loopback Address
Local Broadcast Address: Local Broadcast Address is used to communicate with all the devices on a local network. It is represented by 255.255.255.255 or 11111111.11111111.11111111.11111111 in binary. A broadcast address is used by hosts to request IP addresses from the DHCP(Dynamic Host Configuration Protocol) server. The host sends a broadcast to the broadcast address to request an IP address and in turn the DHCP server allocates an IP address from the pool of IP addresses. By default, local broadcast address is always dropped by routers and layer 3 switches; but one can always override this by configuring the device with DHCP forwarding or DHCP relay....
read more